package maze;

import java.util.Iterator;
import java.util.LinkedList;

public class Path {
	private LinkedList<Vector> directions;
	private Iterator<Vector> it = directions.iterator();
	
	public Path(){
		directions = new LinkedList<Vector>();
	}
	
	public void addStep(Vector step){
		directions.addLast(step);
	}
	
	public boolean hasNext(){
		return it.hasNext();
	}
	/**
	 * 
	 * @return The next vector in this path. Physically, this consists
	 * of an in-place turn followed by a forward movement.
	 */
	public Vector next(){
		return it.next();
	}
}